The generator matrix

 1  1  1  1  1  1  1  1  1  1  1  1  1  1  1  1  1  1  1  1  1  1  1  1  1  1  1  1  1  1  1  1  1  1  1  1  1  1  1  1  1  1  1  1  1  1  1  1  1  1  1  1  1  1  1  1  1  1  1  1  1  1  1
 0 X^2  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 X^2 X^2 X^2  0 X^2  0 X^2  0 X^2  0 X^2  0 X^2 X^2 X^2  0 X^2 X^2 X^2  0 X^2 X^2 X^2  0 X^2 X^2 X^2  0 X^2  0 X^2 X^2 X^2 X^2 X^2  0  0 X^2 X^2 X^2 X^2 X^2
 0  0 X^2  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 X^2 X^2 X^2  0  0  0 X^2  0 X^2  0 X^2  0 X^2  0 X^2 X^2 X^2  0 X^2 X^2 X^2  0 X^2 X^2 X^2  0 X^2 X^2 X^2  0 X^2 X^2 X^2 X^2 X^2 X^2  0  0 X^2 X^2 X^2 X^2 X^2 X^2  0
 0  0  0 X^2  0  0  0  0  0  0  0 X^2 X^2 X^2 X^2 X^2 X^2 X^2 X^2 X^2  0 X^2 X^2  0 X^2 X^2 X^2 X^2  0  0  0  0 X^2  0  0 X^2 X^2  0  0 X^2 X^2  0 X^2  0 X^2 X^2  0  0  0  0  0 X^2 X^2 X^2 X^2  0  0  0  0 X^2 X^2 X^2 X^2
 0  0  0  0 X^2  0  0  0 X^2 X^2 X^2 X^2 X^2  0 X^2 X^2  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 X^2  0 X^2 X^2 X^2  0 X^2 X^2 X^2  0 X^2 X^2 X^2 X^2  0 X^2 X^2 X^2 X^2 X^2  0  0 X^2 X^2 X^2 X^2 X^2 X^2  0  0 X^2
 0  0  0  0  0 X^2  0 X^2 X^2 X^2  0  0  0  0 X^2 X^2 X^2 X^2  0  0  0  0  0  0 X^2 X^2 X^2 X^2 X^2 X^2 X^2 X^2 X^2  0 X^2 X^2 X^2  0 X^2 X^2  0 X^2  0  0  0  0 X^2  0  0  0 X^2 X^2 X^2  0  0 X^2  0 X^2  0 X^2 X^2  0  0
 0  0  0  0  0  0 X^2 X^2  0 X^2 X^2  0 X^2 X^2 X^2  0  0 X^2  0 X^2 X^2  0 X^2 X^2 X^2 X^2  0  0  0  0 X^2 X^2  0  0  0  0 X^2 X^2 X^2 X^2 X^2 X^2  0  0  0 X^2  0 X^2  0 X^2 X^2 X^2  0  0 X^2  0 X^2  0  0  0 X^2 X^2  0

generates a code of length 63 over Z2[X]/(X^3) who´s minimum homogenous weight is 62.

Homogenous weight enumerator: w(x)=1x^0+63x^62+384x^63+63x^64+1x^126

The gray image is a linear code over GF(2) with n=252, k=9 and d=124.
As d=124 is an upper bound for linear (252,9,2)-codes, this code is optimal over Z2[X]/(X^3) for dimension 9.
This code was found by Heurico 1.16 in 0.13 seconds.